On an optimization problem occurring in FMSs: a hypergraph-theoretical formulation
نویسندگان
چکیده
منابع مشابه
On a Hypergraph Matching Problem
Let H = (V,E) be an r-uniform hypergraph and let F ⊂ 2 . A matching M of H is (α,F)perfect if for each F ∈ F , at least α|F | vertices of F are covered by M . Our main result is a theorem giving sufficient conditions for an r-uniform hypergraph to have a (1− ,F)-perfect matching. As a special case of our theorem we obtain the following result. Let K(n, r) denote the complete r-uniform hypergrap...
متن کاملProblem Formulation for Multidisciplinary Optimization
This paper is about multidisciplinary (design) optimization, or MDO, the coupling of two or more analysis disciplines with numerical optimization. The paper has three goals. First, it is an expository introduction to MDO aimed at those who do research on optimization algorithms, since the optimization community has much to contribute to this important class of computational engineering problems...
متن کاملDecision-theoretical formulation of the calibration problem
The choice of calibration policy is of basic importance in analytical chemistry. A prototype of the practical calibration problem is formulated as a mathematical task and a Bayesian solution of the resulting decision problem is presented. The optimum feedback calibration policy can then be found by dynamic programming. The underlying parameter estimation and filtering are solved by updating rel...
متن کاملsolution of security constrained unit commitment problem by a new multi-objective optimization method
چکیده-پخش بار بهینه به عنوان یکی از ابزار زیر بنایی برای تحلیل سیستم های قدرت پیچیده ،برای مدت طولانی مورد بررسی قرار گرفته است.پخش بار بهینه توابع هدف یک سیستم قدرت از جمله تابع هزینه سوخت ،آلودگی ،تلفات را بهینه می کند،و هم زمان قیود سیستم قدرت را نیز برآورده می کند.در کلی ترین حالتopf یک مساله بهینه سازی غیر خطی ،غیر محدب،مقیاس بزرگ،و ایستا می باشد که می تواند شامل متغیرهای کنترلی پیوسته و گ...
On A Hypergraph Turán Problem Of Frankl
Let C r be the 2k-uniform hypergraph obtained by letting P1, . . . ,Pr be pairwise disjoint sets of size k and taking as edges all sets Pi∪Pj with i =j. This can be thought of as the ‘k-expansion’ of the complete graph Kr: each vertex has been replaced with a set of size k. An example of a hypergraph with vertex set V that does not contain C 3 can be obtained by partitioning V = V1∪V2 and takin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 1994
ISSN: 0166-218X
DOI: 10.1016/0166-218x(94)90002-7